Computing with Truly Asynchronous Threshold Logic Networks

We present simulation mechanisms by which any network of threshold logic units with either symmetric or asymmetric interunit connections (i.e., a symmetric or asymmetric \Hoppeld net") can be simulated on a network of the same type, but without any a priori constraints on the order of updates of the units. Together with earlier constructions, the results show that the truly asynchronous network model is com-putationally equivalent to the seemingly more powerful models with either ordered sequential or fully parallel updates.